When Graffiti Brings Order
نویسندگان
چکیده
Most researchers use Petri nets as a formal notation with mathematically defined semantics. Their graphical part is usually only seen as a notation, that does not carry semantics. Contrary to this tradition, we show in this article that, when created by a human, there is inherent semantics in the positions of places, transitions and arcs. We propose to use the full definition of Petri nets: whereas they have been deteriorated to their mathematically defined part only, their graphical information should be considered in their definition.
منابع مشابه
When the Walls Talk: Political Graffiti at la Universidad Nacional in Bogotá, Colombia
Graffiti in Latin America is often political. This thesis considers the political graffiti found at la Universidad Nacional (UNAL) in Bogotá, Colombia. Unlike many other nations in the region, Colombia has not experienced the same political history of repressive dictatorships. As a result, the current literature on political graffiti does not cover the outlier case of Colombia. This research us...
متن کاملUsing a Socio-Technical Approach to Explore Perceptions of the Graffiti Culture
The effectiveness of socio-technical approaches, such as the Soft Systems Methodology (SSM), to structure problematic situations is dependent on the candid communication of participants. This paper reports a pilot study using SSM to explore the challenges of establishing the Ideal Speech Situation in order to gain an understanding of the contradictory perceptions of graffiti. Through exploring ...
متن کاملRecognition of Graffiti Tags
Graffiti tagging, the inscription of an individual graffiti writer’s unique mark in public space, is considered to be an antisocial behaviour and is a criminal offense. Due to the costs involved in the removal of graffiti tags it would be desirable to deter tagging. A searchable database of graffiti images could be an integral part of the policing system aimed at deterring graffiti vandalism. I...
متن کاملSpanning Trees with Many Leaves and Average Distance
In this paper we prove several new lower bounds on the maximum number of leaves of a spanning tree of a graph related to its order, independence number, local independence number, and the maximum order of a bipartite subgraph. These new lower bounds were conjectured by the program Graffiti.pc, a variant of the program Graffiti. We use two of these results to give two partial resolutions of conj...
متن کاملOn Some Conjectures of Griggs and Graffiti
We discuss a conjecture of J. R. Griggs relating the maximum number of leaves in a spanning tree of a simple, connected graph to the order and independence number of the graph. We prove a generalization of this conjecture made by the computer program Graffiti, and discuss other similar conjectures, including several generalizations of the theorem that the independence number of a simple, connec...
متن کامل